An Event-B Plug-in for Creating Deadlock-Freeness Theorems

نویسندگان

  • Faqing Yang
  • Jean-Pierre Jacquot
چکیده

This paper presents DFT-generator, a small tool to generate DeadlockFreeness Theorems (DFT) in Event-B specifications. Event-B, a companion to the B-method, allows specifiers to model systems and environments with the help states, invariants, and events. Events are guarded generalized substitutions which are fired non-deterministically. Assessing temporal properties such as termination or as non-blocking cycle is then a necessity. To overcome the lack of deadlock checking in the core of Event-B and of its supporting environment, Rodin, we have developed a practical little tool which generates the necessary theorems to prove that a model is free of deadlocks. We explain what are the deadlock theorems, why we need a tool to help generating the theorems, what problems were encountered during development. We conclude on a quick comparison with model-checking.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness

Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...

متن کامل

Mutually Exclusive State-Feedback Control of State Machines and Deadlocks of the Resulting System

This paper treats deadlocks and liveness of the closed-loop discrete event system GSCSM|f consisting of a strongly connected state machine (SCSM), a subclass of Petri nets, and a state-feedback which realizes the mutually exclusive control. The GSCSM|f is not always live even if the original SCSM is live, and deadlocks exist in GSCSM|f. A deadlock marking is newly defined and the D-net is propo...

متن کامل

Timing and deadlock - freeness in Continuous Petri nets ?

Timing an unforced (discrete or continuous) net model preserves deadlock-freeness, but not the stronger liveness property, in general. The converse is not true, and if the autonomous net model has deadlocks, the timing may transform it into deadlock-free. Under infinite servers semantics, here we investigate the conditions on the firing rates of continuous timed models that makes deadlock-free ...

متن کامل

Linear Algebraic and Linear Programming Techniques for the Analysis of Place or Transition Net Systems

A b s t r a c t . The structure theory of Place/Transit ion net systems is surveyed incorporating new contributions --in a tutorial style, mainly from a linear algebraic perspective. Topics included are: s ta te equation based analysis of safety properties (e.g., boundedness, mutual exclusion, deadlock-freeness, etc.), linear invariants, siphons and traps, implicit places and their application ...

متن کامل

Discussion on 'Grafcet: Behavioural Issues and Control Synthesis' by Carre-Menetrier and J. Zaytoon

1 The paper discusses a method of generating correct controllers for plants such as manufacturing systems. These controllers ensure a desired control behavior specified by Grafcet models as well as additional safety and operational constraints described by finite automatons. In addition, they always guarantee that the controlled systems are able to reach their initial states again (hence, they ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011